cyk algorithm造句

• The importance of the CYK algorithm stems from its high efficiency in certain situations.
• He is one of the inventors of the CYK algorithm ( C for Cocke ).
• Parser algorithms for context-free languages include the CYK algorithm and Earley's Algorithm.
• Dynamic programming variants of the CYK algorithm find the Viterbi parse of a RNA sequence for a PCFG model.
• Now the sentence " she eats a fish with a fork " is analyzed using the CYK algorithm.
• This obscures the CYK algorithm decision on finding an optimal structure as the correspondence between the parse tree and the structure is not unique.
• Algorithms which use context-free grammars often rely on some variant of the CYK algorithm, usually with some shift-reduce algorithm.
• Human languages are better handled by parsers like Generalized LR parser, the Earley parser, or the CYK algorithm that can simultaneously compute all possible parse trees in one pass.
• This is a subset of the context-free grammars which are accepted by the pushdown automaton and can be parsed in polynomial time, for example by the CYK algorithm.
• Recognition using the GLR algorithm has the same worst-case time complexity as the CYK algorithm and Earley algorithm : " O " ( " n " 3 ).
• For the use in teaching, Lange and Lei?propose a slight generalization of the CYK algorithm, " without compromising efficiency of the algorithm, clarity of its presentation, or simplicity of proofs ".
• For instance, given a context-free grammar, one can use the Chomsky normal form to construct a polynomial-time algorithm that decides whether a given string is in the language represented by that grammar or not ( the CYK algorithm ).